Computable absolutely normal numbers and discrepancies
نویسندگان
چکیده
منابع مشابه
A computable absolutely normal Liouville number
We give an algorithm that computes an absolutely normal Liouville number. 1. The main result The set of Liouville numbers is {x ∈ R \Q : ∀k ∈ N, ∃q ∈ N, q > 1 and ||qx|| < q−k} where ||x|| = min{|x−m| : m ∈ Z} is the distance of a real number x to the nearest integer and other notation is as usual. Liouville’s constant, ∑ k≥1 10 −k!, is the standard example of a Liouville number. Though uncount...
متن کاملAn example of a computable absolutely normal number
The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski’s construction which produces a computable absolutely normal number.
متن کاملOn absolutely normal numbers and their discrepancy estimate
The algorithm computes the first n digits of the expansion of x in base 2 after performing triple-exponential in n mathematical operations. It is well known that for almost all real numbers x and for all integers b greater than or equal to 2, the sequence {bx}j≥0 is uniformly distributed in the unit interval, which means that its discrepancy tends to 0 as N goes to infinity. In [6], Gál and Gál...
متن کاملA polynomial-time algorithm for computing absolutely normal numbers
We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.
متن کاملComputing Absolutely Normal Numbers in Nearly Linear Time
A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of digits appear with equal asymptotic frequency in the base-b expansion of x. This paper presents an explicit algorithm that generates the binary expansion of an absolutely normal number x, with the nth bit of x appearing after npolylog(n) computation steps. This speed is achieved by simultaneously co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 2017
ISSN: 0025-5718,1088-6842
DOI: 10.1090/mcom/3189